* organized graph algorithms

* all graph algorithms in Graphs/ folder

* all graph algorithms are in one folder

* Rename number theory/factorial_python.py to maths/factorial_python.py

* Added extended euclidean algorithm

* Fixed extended euclidean algorithm

…621)

* Create infix_to_prefix_conversion.py

* Create postfix_evaluation.py

* Update balanced_parentheses.py

Added comments for the better understanding of heap.

I have added the comments for better understanding.

The method returns the truth when the stack is empty

* Wiggle_sort

* Rename Wiggle_Sort to wiggle_sort.py

* Create Searching in sorted matrix

* Rename Searching in sorted matrix to searching_in_sorted_matrix.py

* added matrix minor

* added matrix determinant

* added inverse,scalar multiply, identity, transpose

* add longest common ancestor in data structures

* add lowest common ancestor to data structures

…ve factorial algorithm. (#763)

* Renaming directories
* Adding a recursive factorial algorithm

Edmonds Karp algorithm is traditionally with only one source and one sink. What do you do if you have multiple sources and sinks? This algorithm is a generalized algorithm that regardless of however many sinks and sources you have, will allow you to use this algorithm. It does this by using the traditional algorithm but adding an artificial source and sink that allows with "infinite" weight.

* Added an O(1) solution to problem 002

* Removed comments from sol3.py that were accidentally added to sol4.py

To avoid confusion all 'sorted' to 'ascending sorted' in comments

http://www.lpb-riannetrujillo.com/blog/python-fractal/ moved to http://www.riannetrujillo.com/blog/python-fractal/

Current implementation is buggy and hard to read.

* Negative values were raising a TypeError due to `math.sqrt`
* 1 was considered prime, it is not.
* 2 was considered not prime, it is.

The implementation has been corrected to fix the bugs and to enhance
readability.

A docstring has been added with the definition of a prime number.

A complete test suite has been written, it tests the 10 first primes, a
negative value, 0, 1 and some not prime numbers.

closes #795

* Added page-rank algorithm implementation

* changed init variables

* More elegant coding for merge_sort_fastest

* More elegant coding for merge_sort

* Travis CI: Add more flake8 tests

* Use ==/!= to compare str, bytes, and int literals

./project_euler/problem_17/sol1.py:25:7: F632 use ==/!= to compare str, bytes, and int literals
			if i%100 is not 0:
      ^

* Use ==/!= to compare str, bytes, and int literals

* Update sol1.py

* Created shortest path using bfs

…description (#793)

* fix endless loop bug, divide 0 bug and update description

fix an endless bug, for example, if collection = [10,30,40,45,50,66,77,93], item = 67.

fix divide 0 bug,  when right=left it is not OK to point = left + ((item - sorted_collection[left]) * (right - left)) // (sorted_collection[right] - sorted_collection[left])

update 'sorted' to 'ascending sorted' in description to avoid confusion

* delete swap files

* delete 'address' and add input validation

* Some simplification

* change besd to best

…med graph.py to graph_list.py (#820)

* fix empty list validation and code data structures

* Update bucket_sort.py

#826 (review)